A heuristic algorithm for computing the max-min inverse fuzzy relation
نویسندگان
چکیده
The paper addresses a classical problem of computing approximate max–min inverse fuzzy relation. It is an NP-complete problem for which no polynomial time algorithm is known till this date. The paper employs a heuristic function to reduce the search space for finding the solution of the problem. The time-complexity of the proposed algorithm is OðnÞ, compared to OðknÞ, which is required for an exhaustive search in the real space of 1⁄20; 1 at k regular intervals of interval length (1=k). 2002 Elsevier Science Inc. All rights reserved.
منابع مشابه
An Efficient Algorithm to Computing Max-Min Post-inverse Fuzzy Relation for Abductive Reasoning
This paper provides an alternative formulation to computing the max–min inverse fuzzy relation by embedding the inherent constraints of the problem into a heuristic (objective) function. The optimization of the heuristic function guarantees maximal satisfaction of the constraints, and consequently, the condition for optimality yields solution to the inverse problem. An algorithm for computing t...
متن کاملRESOLUTION OF NONLINEAR OPTIMIZATION PROBLEMS SUBJECT TO BIPOLAR MAX-MIN FUZZY RELATION EQUATION CONSTRAINTS USING GENETIC ALGORITHM
This paper studies the nonlinear optimization problems subject to bipolar max-min fuzzy relation equation constraints. The feasible solution set of the problems is non-convex, in a general case. Therefore, conventional nonlinear optimization methods cannot be ideal for resolution of such problems. Hence, a Genetic Algorithm (GA) is proposed to find their optimal solution. This algorithm uses th...
متن کاملMax-Min averaging operator: fuzzy inequality systems and resolution
Minimum and maximum operators are two well-known t-norm and s-norm used frequently in fuzzy systems. In this paper, two different types of fuzzy inequalities are simultaneously studied where the convex combination of minimum and maximum operators is applied as the fuzzy relational composition. Some basic properties and theoretical aspects of the problem are derived and four necessary and suffi...
متن کاملA CONSTRAINED SOLID TSP IN FUZZY ENVIRONMENT: TWO HEURISTIC APPROACHES
A solid travelling salesman problem (STSP) is a travelling salesman problem (TSP) where the salesman visits all the cities only once in his tour using dierent conveyances to travel from one city to another. Costs and environmental eect factors for travelling between the cities using dierent conveyances are dierent. Goal of the problem is to nd a complete tour with minimum cost that damages the ...
متن کاملRole of Different Fuzzy Min- Max Neural Network for Pattern Classification
Different neural networks related to Fuzzy min-max (FMM) has been studied and amongst all, Enhanced Fuzzy min-max (EFMM) neural network is most recent. For classification of patterns a new Enhanced Fuzzy Min-Max (EFMM) algorithm has been studied. The aim of EFMM is to improve the performance and minimize the restrictions that are possessed by original fuzzy min-max (FMM) network. Three heuristi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Approx. Reasoning
دوره 30 شماره
صفحات -
تاریخ انتشار 2002